Recycling computed answers in rewrite systems for abduction

On Computing Constraint Abduction Answers

We address the problem of computing and representing answers of constraint abduction problems over the Herbrand domain. This problem is of interest when performing type inference involving generalized algebraic data types. We show that simply recognizing a maximally general answer or fully maximal answer is co-NP complete. However we present an algorithm that computes the (finite) set of fully ...

Rewrite Systems

Rewrite Systems for Integer Arithmetic

H.Zantema Utrecht University, Compo Sc. Dept. P.O. Box 80.089, 3508 TB Utrecht [email protected] We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and prede...

Rewrite systems for integer arithmetic

H.Zantema Utrecht University, Compo Sc. Dept. P.O. Box 80.089, 3508 TB Utrecht [email protected] We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and prede...

Rewrite systems for integer arithmetic

H.Zantema Utrecht University, Compo Sc. Dept. P.O. Box 80.089, 3508 TB Utrecht [email protected] We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and prede...